TSTP Solution File: NUM653^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM653^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:55:58 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 36 ( 12 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 95 ( 28 ~; 7 |; 2 &; 46 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 ^ 11 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
less: nat > nat > $o ).
thf(decl_25,type,
more: nat > nat > $o ).
thf(satz10b,axiom,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ( X2 != X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jhzGU01yqn/E---3.1_7208.p',satz10b) ).
thf(l,axiom,
( ~ ( less @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox/tmp/tmp.jhzGU01yqn/E---3.1_7208.p',l) ).
thf(satz10d,conjecture,
~ ( more @ x @ y ),
file('/export/starexec/sandbox/tmp/tmp.jhzGU01yqn/E---3.1_7208.p',satz10d) ).
thf(c_0_3,plain,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ ( more @ X2 @ X3 ) )
=> ~ ~ ( ( ( more @ X2 @ X3 )
=> ~ ( less @ X2 @ X3 ) )
=> ~ ( ( less @ X2 @ X3 )
=> ( X2 != X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz10b]) ).
thf(c_0_4,plain,
( ~ ( less @ x @ y )
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
thf(c_0_5,plain,
! [X7: nat,X8: nat] :
( ( ( X7 != X8 )
| ~ ( more @ X7 @ X8 ) )
& ( ~ ( more @ X7 @ X8 )
| ~ ( less @ X7 @ X8 ) )
& ( ~ ( less @ X7 @ X8 )
| ( X7 != X8 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,plain,
( ( less @ x @ y )
| ( x = y ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
more @ x @ y,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz10d])]) ).
thf(c_0_8,plain,
! [X2: nat,X3: nat] :
( ~ ( more @ X2 @ X3 )
| ~ ( less @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( less @ x @ y )
| ( x = y ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
more @ x @ y,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
| ~ ( more @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_12,plain,
x = y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
thf(c_0_13,plain,
! [X2: nat] :
~ ( more @ X2 @ X2 ),
inference(er,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM653^1 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:33:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jhzGU01yqn/E---3.1_7208.p
% 0.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.51 # sh4l with pid 7294 completed with status 0
% 0.22/0.51 # Result found by sh4l
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGHSF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # new_ho_10 with pid 7299 completed with status 0
% 0.22/0.51 # Result found by new_ho_10
% 0.22/0.51 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.51 # Starting sh4l with 300s (1) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGHSF-FFSF00-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 9
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 11
% 0.22/0.51 # Removed in clause preprocessing : 6
% 0.22/0.51 # Initial clauses in saturation : 5
% 0.22/0.51 # Processed clauses : 13
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 13
% 0.22/0.51 # Other redundant clauses eliminated : 2
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 2
% 0.22/0.51 # Generated clauses : 3
% 0.22/0.51 # ...of the previous two non-redundant : 3
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 1
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 2
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 2
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 4
% 0.22/0.51 # Positive orientable unit clauses : 1
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 1
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 7
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 2
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 1
% 0.22/0.51 # BW rewrite match successes : 1
% 0.22/0.51 # Condensation attempts : 13
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 463
% 0.22/0.51 # Search garbage collected termcells : 96
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1576 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.008 s
% 0.22/0.51 # Maximum resident set size: 1724 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------